Grasp: Visualizing the behavior of hierarchical multiprocessor real-time systems
نویسندگان
چکیده
Trace visualization is a viable approach for gaining insight into the behavior of complex distributed realtime systems. Grasp is a versatile trace visualization toolset. Its flexible plugin infrastructure allows for easy extension with custom visualization and analysis techniques for automatic trace verification. This paper presents its visualization capabilities for hierarchical multiprocessor systems, including partitioned and global multiprocessor scheduling with migrating tasks and jobs, communication between jobs via shared memory and message passing, and hierarchical scheduling in combination with multiprocessor scheduling. For tracing distributed systems with asynchronous local clocks Grasp also supports the synchronization of traces from different processors during the visualization and analysis. 2012 Elsevier B.V. All rights reserved.
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملMultiprocessor Scheduling For Real Time Systems Embedded Systems
energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...
متن کاملTwo-level Hierarchical Scheduling Algorithm for Real-time Multiprocessor Systems
The Earliest Deadline First (EDF) scheduling algorithm has the least runtime complexity among joblevel fixed-priority algorithms for scheduling tasks on multiprocessor architectures. However, EDF suffers from suboptimality in multiprocessor systems. This paper proposes a new restricted migration-based scheduling algorithm for multiprocessor real-time systems, called Two-level Hierarchical Sched...
متن کاملAn Investigation of Synchronization under Multiprocessors Hierarchical Scheduling*
In the multi-core and multiprocessor research community, considerable work has been done on real-time multiprocessor scheduling algorithms where it is assumed the tasks are independent. However in practice a typical real-time system includes tasks that share resources. On the other hand, synchronization in the multiprocessor context has not received enough attention. In this paper we propose an...
متن کاملTowards Energy-aware Multiprocessor Hierarchical Scheduling of Real-time Systems
Multiprocessor platforms are becoming increasingly more popular. Providing more computation capacity on a single hardware platform, multiprocessors make it possible to integrate previously federated real-time systems onto a single platform. Multiprocessor hierarchical scheduling techniques provide the ground for composing real-time components, while guaranteeing the timing correctness of the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Systems Architecture - Embedded Systems Design
دوره 59 شماره
صفحات -
تاریخ انتشار 2013